On Solving Linear Diophantine Systems Using Generalized Rosser’s Algorithm
نویسندگان
چکیده
A difficulty in solving linear Diophantine systems is the rapid growth of intermediate results. Rosser’s algorithm for solving a single linear Diophatine equation is an efficient algorithm that effectively controls the growth of intermediate results. Here, we propose an approach to generalize Rosser’s algorithm and present two algorithms for solving systems of linear Diophantine equations. Then, we show that the generalized approach provides us with a new formulation of the LDSSBR of Chou and Collins and a more efficient implementation of Rosser’s approach. The new formulation also enables us to propose an efficient algorithm for solving rank one perturbed linear Diophantine systems based on the LDSSBR, and to improve and extend the class of integer ABS algorithms for solving linear Diophantine systems.
منابع مشابه
Numerical Experiments with the LLL-Based Hermite Normal Form Algorithm for Solving Linear Diophantine Systems
In this paper we are concerned with the practical performance of the LLL-based Hermite normal form algorithm, proposed by Havas [13] (LLLHMM) when applied to solve linear Diophantine systems. We first compare the efficiency of the LLLHMM with the algorithm, named LDSSBR, based on the Rosser’s idea. The numerical results show that for small problems, the bit length of the longest integer occurri...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملSolving Linear Diophantine Constraints Incrementally
In this paper, we show how to handle linear Diophantine constraints incre-mentally by using several variations of the algorithm by Contejean and Devie (hereafter called ABCD) for solving linear Diophantine systems 4, 5]. The basic algorithm is based on a certain enumeration of the potential solutions of a system, and termination is ensured by an adequate restriction on the search. This algorith...
متن کاملComplete Solving of Linear
In this paper, we present an algorithm for solving directly linear Diophantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities. This algorithm is an extension of the algorithm due to Con-tejean and Devie 9] for solving linear Diophantine systems of equations, which is itself a generalization of the algorithm o...
متن کامل